Self-organizing Bluetooth scatternets

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.Includes bibliographical references (p. 71-73).There is increasing interest in wireless ad hoc networks built from portable devices equipped with short-range wireless network interfaces. This thesis addresses issues related to internetworking such networks to form larger "scatternets." Within the constraints imposed by the emerging standard Bluetooth link layer and MAC protocol, we develop a set of online algorithms to form scatternets and to schedule point-to-point communication links. Our efficient online topology formation algorithm, called TSF (Tree Scatternet Formation), builds scatternets by connecting nodes into a tree structure that simplifies packet routing and scheduling. Unlike earlier works, our design does not restrict the number of nodes in the scatternet, and also allows nodes to arrive and leave at arbitrary times, incrementally building the topology and healing partitions when they occur. We have developed a Bluetooth simulator in ns which includes most aspects of the entire Bluetooth protocol stack. It was used to derive simulation results that show that TSF has low latencies in link establishment, tree formation and partition healing. All of these grow logarithmically with the number of nodes in the scatternet. Furthermore, TSF generates tree topologies where the average path length between any node pair grows logarithmically with the size of the scatternet. Our scheduling algorithm, called TSS (Tree Scatternet Scheduling), takes advantage of the tree structure of the scatternets constructed by TSF. Unlike previous works, TSS coordinates one-hop neighbors effectively to increase the overall performance of the scatternet. In addition, TSS is robust and responsive to network conditions, adapting the inter-piconet link schedule effectively based on varying workload conditions. We demonstrate that TSS has good performance on throughput and latency under various traffic loads.by Godfrey Tan.S.M

Improving aggregate user utilities and providing fairness in multi-rate wireless LANs

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.Includes bibliographical references (p. 159-166).A distributed medium access control (MAC) protocol is responsible for allocating the shared spectrum efficiently and fairly among competing devices using a wireless local area network. Unfortunately, existing MAC protocols, including 802.11's DCF, achieve neither efficiency nor fairness under many realistic conditions. In this dissertation, we show that both bit and frame-based fairness,the most widely used notions, lead to drastically reduced aggregate throughput and increased average delay in typical environments, in which competing nodes transmit at different data transmission rates. We demonstrate the advantages of time-based fairness, in which each competing node receives an equal share of the wireless channel occupancy time. Through analysis, experiments on a Linux test bed, and simulation, we demonstrate that time-based fairness can lead to significant improvements in aggregate throughput and average delay. Through a game theoretic analysis and simulation, we also show that existing MAC protocols encourage non-cooperative nodes to employ globally inefficient transmission strategies that lead to low aggregate throughput. We show that providing long-term time share guarantees among competing nodes leads rational nodes to employ efficient transmission strategies at equilibriums.(cont.) We describe two novel solutions, TES (Time-fair Efficient and Scalable MAC protocol) and TBR (Time-based Regulator) that provide time-based fairness and long-term time share guarantees among competing nodes. TBR is a backward-compatible centralized solution that runs at the AP,works in conjunction with DCF, and requires no modifications to clients nor to DCF. TBR is appropriate for existing access point based networks, but not effective when nearby non-cooperative nodes fall under different administrative domains. Our evaluation of TBR on an 802.1lb/Linux test bed shows that TBR can improve aggregate TCP throughput by as much as 105% in rate diverse environments. TES is a non-backward compatible distributed contention-based MAC protocol that is effective in any environment, including non-cooperative environments. Furthermore, the aggregate throughputs sustained with increased loads. Through extensive simulation experiments, we demonstrate that TES is significantly more efficient(as much as 140% improvement in aggregate TCP throughput) and fairer than existing MAC protocols including DCF.by Godfrey Tan.Ph.D